Tetrisation of triangular meshes and its application in shape blending

The As-Rigid-As-Possible (ARAP) shape deformation framework is a versatile technique for morphing, surface modelling, and mesh editing. We discuss an improvement of the ARAP framework in a few aspects: 1. Given a triangular mesh in 3D space, we introduce a method to associate a tetrahedral structure, which encodes the geometry of the original mesh. 2. We use a Lie algebra based method to interpolate local transformation, which provides better handling of rotation with large angle. 3. We propose a new error function to compile local transformations into a global piecewise linear map, which is rotation invariant and easy to minimise. We implemented a shape blender based on our algorithm and its MIT licensed source code is available online

Convexity-Increasing Morphs of Planar Graphs

We study the problem of convexifying drawings of planar graphs. Given any planar straight-line drawing of an internally 3-connected graph, we show how to morph the drawing to one with strictly convex faces while maintaining planarity at all times. Our morph is convexity-increasing, meaning that once an angle is convex, it remains convex. We give an efficient algorithm that constructs such a morph as a composition of a linear number of steps where each step either moves vertices along horizontal lines or moves vertices along vertical lines. Moreover, we show that a linear number of steps is worst-case optimal. To obtain our result, we use a well-known technique by Hong and Nagamochi for finding redrawings with convex faces while preserving y-coordinates. Using a variant of Tutte's graph drawing algorithm, we obtain a new proof of Hong and Nagamochi's result which comes with a better running time. This is of independent interest, as Hong and Nagamochi's technique serves as a building block in existing morphing algorithms.Comment: Preliminary version in Proc. WG 201

Pole Dancing: 3D Morphs for Tree Drawings

We study the question whether a crossing-free 3D morph between two straight-line drawings of an $n$-vertex tree can be constructed consisting of a small number of linear morphing steps. We look both at the case in which the two given drawings are two-dimensional and at the one in which they are three-dimensional. In the former setting we prove that a crossing-free 3D morph always exists with $O(\log n)$ steps, while for the latter $\Theta(n)$ steps are always sufficient and sometimes necessary.Comment: Appears in the Proceedings of the 26th International Symposium on Graph Drawing and Network Visualization (GD 2018

Discretization of the Region of Interest

[EN]The meccano method was recently introduced to construct simultaneously tetrahedral meshes and volumetric parameterizations of solids. The method requires the information of the solid geometry that is defined by its surface, a meccano, i.e., an outline of the solid defined by connected polyhedral pieces, and a tolerance that fixes the desired approximation of the solid surface. The method builds an adaptive tetrahedral mesh of the solid (physical domain) as a deformation of an appropriate tetrahedral mesh of the meccano (parametric domain). The main stages of the procedure involve an admissible mapping between the meccano and the solid boundaries, the nested Kossaczký’s refinement, and our simultaneous untangling and smoothing algorithm. In this chapter, we focus on the application of the method to build tetrahedral meshes over complex terrain, that is interesting for simulation of environmental processes. A digital elevation map of the terrain, the height of the domain, and the required orography approximation are given as input data. In addition, the geometry of buildings or stacks can be considered. In these applications, we have considered a simple cuboid as meccano.Ministerio de Economía y Competitividad, Gobierno de España; Fondos FEDER; Departamento de Educación, Junta de Castilla y León; CONACYT-SENER, Fondo Sectorial CONACYT SENER HIDROCARBUROS

One More Step Towards Well-Composedness of Cell Complexes over nD Pictures

An nD pure regular cell complex K is weakly well-composed (wWC) if, for each vertex v of K, the set of n-cells incident to v is face-connected. In previous work we proved that if an nD picture I is digitally well composed (DWC) then the cubical complex Q(I) associated to I is wWC. If I is not DWC, we proposed a combinatorial algorithm to “locally repair” Q(I) obtaining an nD pure simplicial complex PS(I) homotopy equivalent to Q(I) which is always wWC. In this paper we give a combinatorial procedure to compute a simplicial complex PS(¯I) which decomposes the complement space of |PS(I)| and prove that PS(¯I) is also wWC. This paper means one more step on the way to our ultimate goal: to prove that the nD repaired complex is continuously well-composed (CWC), that is, the boundary of its continuous analog is an (n − 1)- manifold.Ministerio de Economía y Competitividad MTM2015-67072-

SYNAPS: A library for dedicated applications in symbolic numeric computing,

International audienceWe present an overview of the open source library synaps. We describe some of the representative algorithms of the library and illustrate them on some explicit computations, such as solving polynomials and computing geometric information on implicit curves and surfaces. Moreover, we describe the design and the techniques we have developed in order to handle a hierarchy of generic and specialized data-structures and routines, based on a view mechanism. This allows us to construct dedicated plugins, which can be loaded easily in an external tool. Finally, we show how this design allows us to embed the algebraic operations, as a dedicated plugin, into the external geometric modeler axel

As-Rigid-As-Possible Surface Morphing

This paper presents a new morphing method based on the “as-rigid-as-possible” approach. Unlike the original as-rigid-as-possible method, we avoid the need to construct a consistent tetrahedral mesh, but instead require a consistent triangle surface mesh and from it create a tetrahedron for each surface triangle. Our new approach has several significant advantages. It is much easier to create a consistent triangle mesh than to create a consistent tetrahedral mesh. Secondly, the equations arising from our approach can be solved much more efficiently than the corresponding equations for a tetrahedral mesh. Finally, by incorporating the translation vector in the energy functional controlling interpolation, our new method does not need the user to arbitrarily fix any vertex to obtain a solution, allowing artists automatic control of interpolated mesh positions